Searching of Top-K Objects: A Survey
نویسنده
چکیده
This paper addresses a problem of searching the best K objects in more attributes, which is indicated as a top-K problem. Last few years, research of top-K problem solving is in progress. The aim of this paper was to provide an introduction into top-K problem and present various interesting top-K processing methods. Firstly, this paper focuses on the family of threshold algorithm, which uses monotone aggregate function Then approaches, which uses not monotone aggregate function, are presented. This paper also describes top-K processing techniques for XML data and some other interesting approaches.
منابع مشابه
Top-k aggregator
In this paper we describe a tool named top-k aggregator. Using this tool we can retrieve some best objects with respect to user requirements. User can say which values of properties of offers (e.g. salary, education requirement, place, working hours per week) are interesting for him or her, how much and also which are not interesting. Another form of user specification can be made by evaluation...
متن کاملTop-k Spatial Preference Queries in Directed Road Networks
Top-k spatial preference queries rank objects based on the score of feature objects in their spatial neighborhood. Top-k preference queries are crucial for a wide range of location based services such as hotel browsing and apartment searching. In recent years, a lot of research has been conducted on processing of top-k spatial preference queries in Euclidean space. While few algorithms study to...
متن کاملTop-k Searching for More Users in Multidimensional B-tree with Lists
In the last few years, research of top-k processing is in progress in various domains. The aim of our research is efficient top-k searching of the best k objects with more attributes according to complex user preferences. We use a model of user preferences based on fuzzy functions. In our previous research we focus on top-k searching in tree-oriented data structures and we developed various top...
متن کاملCombination of TA- and MD-algorithm for Efficient Solving of Top-K Problem according to User's Preferences
In this article we focus on efficient solving of searching the best K objects in more attributes according to user’s preferences. Local preferences are modelled with one of four types of fuzzy function. Global preferences are modelled concurrently with an aggregation function. We focused on searching the best K objects according to various user’s preferences without accessing all objects. There...
متن کاملA Novel Hybrid Approach for Email Spam Detection based on Scatter Search Algorithm and K-Nearest Neighbors
Because cyberspace and Internet predominate in the life of users, in addition to business opportunities and time reductions, threats like information theft, penetration into systems, etc. are included in the field of hardware and software. Security is the top priority to prevent a cyber-attack that users should initially be detecting the type of attacks because virtual environments are not moni...
متن کامل